On the computational power of constant-depth quantum circuits with gates for addition

نویسندگان

  • Yasuhiro Takahashi
  • Yasuhito Kawano
  • Masahiro Kitagawa
چکیده

We investigate a class QNC(ADD) that is QNC with gates for addition of two binary numbers, where QNC is a class consisting of quantum operations computed by constant-depth quantum circuits. We show that QNC(ADD) = QAC(PAR) = QAC(MUL), where QAC(PAR) and QAC(MUL) are QAC with gates for parity and multiplication respectively, and where QAC is QNC with Toffoli gates of arbitrary fan-in. In the classical setting, similar relationships do not hold. These relationships suggest that QNC QNC(ADD); that is, the use of gates for addition increases the computational power of constant-depth quantum circuits. To prove QNC QNC(ADD), we characterize it by the one-wayness of a permutation that is constructed explicitly. We conjecture that the permutation is one-way, which implies QNC QNC(ADD).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimization of Quantum Cellular Automata Circuits by Genetic Algorithm

Quantum cellular automata (QCA) enables performing arithmetic and logic operations at the molecular scale. This nanotechnology promises high device density, low power consumption and high computational power. Unlike the CMOS technology where the ON and OFF states of the transistors represent binary information, in QCA, data is represented by the charge configuration. The primary and basic devic...

متن کامل

On the Computational Power of Sigmoid versus Boolean Threshold Circuits

We examine the power of constant depth circuits with sigmoid (i.e. smooth) threshold gates for computing boolean functions. It is shown that, for depth 2, constant size circuits of this type are strictly more powerful than constant size boolean threshold circuits (i.e. circuits with boolean threshold gates). On the other hand it turns out that, for any constant depth d , polynomial size sigmoid...

متن کامل

A Minimal-Cost Inherent-Feedback Approach for Low-Power MRF-Based Logic Gates

The Markov random field (MRF) theory has been accepted as a highly effective framework for designing noise-tolerant nanometer digital VLSI circuits. In MRF-based design, proper feedback lines are used to control noise and keep the circuits in their valid states. However, this methodology has encountered two major problems that have limited the application of highly noise immune MRF-based circui...

متن کامل

Power of Uninitialized Qubits in Shallow Quantum Circuits

We study the computational power of shallow quantum circuits with n input qubits, one output qubit, and two types of ancillary qubits: O(log n) initialized and O(poly(n)) uninitialized qubits. The initial state of the uninitialized ancillary qubits is arbitrary, and we have to return their state into the initial one at the end of the computation. First, to show the strengths of such circuits, w...

متن کامل

Performance Analysis of Reversible Sequential Circuits Based on Carbon NanoTube Field Effect Transistors (CNTFETs)

This study presents the importance of reversible logic in designing of high performance and low power consumption digital circuits. In our research, the various forms of sequential reversible circuits such as D, T, SR and JK flip-flops are investigated based on carbon nanotube field-effect transistors. All reversible flip-flops are simulated in two voltages, 0.3 and 0.5 Volt. Our results show t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003